On the resultant of degree-deficient polynomials
نویسنده
چکیده
The resultant is an algebraic expression, computable in a finite number of arithmetic operations from the coefficients of two univariate polynomials, that vanishes if, and only if, the two polynomials have common zeros. The paper considers formal resultant for degree-deficient polynomials (polynomials whose actual degree is lower than their assumed degree). Some key properties of the resultant are extended to formal resultants including its expression by the finite zeros of the polynomials. Key–Words: Resultant, Sylvester matrix, Bezout matrix, GCD of polynomials.
منابع مشابه
Trajectory Planning Using High Order Polynomials under Acceleration Constraint
The trajectory planning, which is known as a movement from starting to end point by satisfying the constraints along the path is an essential part of robot motion planning. A common way to create trajectories is to deal with polynomials which have independent coefficients. This paper presents a trajectory formulation as well as a procedure to arrange the suitable trajectories for applications. ...
متن کاملMatrix Formulae of Differential Resultant for First Order Generic Ordinary Differential Polynomials
In this paper, a matrix representation for the differential resultant of two generic ordinary differential polynomials f1 and f2 in the differential indeterminate y with order one and arbitrary degree is given. That is, a non-singular matrix is constructed such that its determinant contains the differential resultant as a factor. Furthermore, the algebraic sparse resultant of f1, f2, δf1, δf2 t...
متن کاملExplicit factors of some iterated resultants and discriminants
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into irreducible factors of several constructions involving two times iterated univariate resultants and discriminants over the integer universal ring of coe cien...
متن کاملOn the Construction of Generic Mixed Cayley-Sylvester Resultant Matrix
For a generic n-degree polynomial system which contains n+1 polynomials in n variables, we give the construction of the generic mixed Cayley-Sylvester resultant matrix. There are n− 1 generic mixed Cayley-Sylvester resultant matrices between the classical Cayley resultant matrix and the classical Sylvester resultant matrix. The entries of these new resultant matrix are of degree m(1 < m < n + 1...
متن کاملRectangular Corner Cutting Sylvester
This paper presents a way to construct the Sylvester A-resultant matrix for three bi-degree (m; n) polynomials whose exponent set is cut oo by rectangles at the corners. The paper also shows that the determinant of this matrix does give the resultant of the three polynomials.
متن کامل